Stochastic Local Search Techniques with Unimodal Continuous Distributions: A Survey

نویسنده

  • Petr Posík
چکیده

In continuous black-box optimization, various stochastic local search techniques are often employed, with various remedies for fighting the premature convergence. This paper surveys recent developments in the field (the most important from the author’s perspective), analyzes the differences and similarities and proposes a taxonomy of these methods. Based on this taxonomy, a variety of novel, previously unexplored, and potentially promising techniques may be envisioned.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using a new modified harmony search algorithm to solve multi-objective reactive power dispatch in deterministic and stochastic models

The optimal reactive power dispatch (ORPD) is a very important problem aspect of power system planning and is a highly nonlinear, non-convex optimization problem because consist of both continuous and discrete control variables. Since the power system has inherent uncertainty, hereby, this paper presents both of the deterministic and stochastic models for ORPD problem in multi objective and sin...

متن کامل

On discrete a-unimodal and a-monotone distributions

Unimodality is one of the building structures of distributions that like skewness, kurtosis and symmetry is visible in the shape of a function. Comparing two different distributions, can be a very difficult task. But if both the distributions are of the same types, for example both are unimodal, for comparison we may just compare the modes, dispersions and skewness. So, the concept of unimodali...

متن کامل

Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces

Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime are limited to discrete search spaces, yet EAs are mostly applied to continuous optimization problems. So far results on the runtime of EAs for continuous search spaces rely on validation by experiments/simulations sinc...

متن کامل

Characterizing the Run-time Behavior of Stochastic Local Search

Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from diierent domains. One important feature of SLS algorithms is the fact that their run-time behavior is characterized by a random variable. Consequently, the detailed knowledge of the run-time distribution provides important information for the analysis of SLS algorithms. In this paper we i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009